Smoothing a polyhedral convex function via cumulant transformation and homogenization
نویسندگان
چکیده
منابع مشابه
Mono-parametric Tiling is a Polyhedral Transformation
Tiling is a crucial program transformation with many benefits: it improves locality, exposes parallelism, allows for adjusting the ops-to-bytes balance of codes, and can be applied at multiple levels. Allowing tile sizes to be symbolic parameters at compile time has many benefits, including efficient autotuning, and run-time adaptability to system variations. For polyhedral programs, parametric...
متن کاملA Smoothing Method for Sparse Optimization over Polyhedral Sets
In this paper, we investigate a class of heuristics schemes to solve the NP-hard problem of minimizing `0-norm over a polyhedral set. A wellknown approximation is to consider the convex problem of minimizing `1-norm. We are interested in nding improved results in cases where the problem in `1-norm does not provide an optimal solution to the `0-norm problem. We consider a relaxation technique us...
متن کاملA Convex Condition for Robust Stability Analysis via Polyhedral Lyapunov Functions
In this paper we study the robustness analysis problem for linear continuous-time systems subject to parametric time-varying uncertainties making use of piecewise linear (polyhedral) Lyapunov functions. A given class of Lyapunov functions is said to be “universal” for the uncertain system under consideration if the robust stability of the system is equivalent to the existence of a Lyapunov func...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملPolyhedral studies on the convex recoloring
A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 1997
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap-67-3-259-268